Lagrangean-based solution approaches for the generalized problem of locating capacitated warehouses
نویسندگان
چکیده
منابع مشابه
Lagrangean duals and exact solution to the capacitated p-center problem
In this work we study the Capacitated p-Center Problem (CpCP ) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP , and we propose two different Lagrangean duals based on each of the auxiliary problems. The lower and upper bounds provided by each of the Lagrangean duals reduce notably the set of candidate radii and allow to solve the proble...
متن کاملrobust optimization model for locating and capacitated hub covering problem
in this paper, a robust model presented is developed for hub covering flow problem in which hubs have capacity. this problem has two objective functions converting to a single-objective problem by using weighting method. firstly, the problem will be formulated in a certain case. then, by considering the demand as a non-random variable, it will be modeled by robust optimization. finally, by usin...
متن کاملCAPACITATED VEHICLE ROUTING PROBLEM WITH VEHICLES HIRE OR PURCHASE DECISION: MODELING AND SOLUTION APPROACHES
The overall cost of companies dealing with the distribution tasks is considerably affected by the way that distributing vehicles are procured. In this paper, a more practical version of capacitated vehicle routing problem (CVRP) in which the decision of purchase or hire of vehicles is simultaneously considered is investigated. In CVRP model capacitated vehicles start from a single depot simulta...
متن کاملDecomposition Approaches for a Capacitated Hub Problem
In this work we address a capacitated hub problem arising from a Telecommunications application. In this problem we must choose the routes and the hubs to use in order to send a set of commodities from sources to destinations in a given capacitated network with a minimum cost. The capacities and costs of the arcs and hubs are given, and the graph connecting the hubs is not assumed to be complet...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2008
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.2007.00616.x